%0 Conference Proceedings
%4 sid.inpe.br/sibgrapi/2017/08.22.03.04
%2 sid.inpe.br/sibgrapi/2017/08.22.03.04.13
%@doi 10.1109/SIBGRAPI.2017.12
%T Repairing Non-manifold Boundaries of Segmented Simplicial Meshes
%D 2017
%A Choque, Tony L.,
%A Cuadros, Alex J.,
%@affiliation Universidad Católica San Pablo
%@affiliation Universidad Católica San Pablo
%E Torchelsen, Rafael Piccin,
%E Nascimento, Erickson Rangel do,
%E Panozzo, Daniele,
%E Liu, Zicheng,
%E Farias, Mylène,
%E Viera, Thales,
%E Sacht, Leonardo,
%E Ferreira, Nivan,
%E Comba, João Luiz Dihl,
%E Hirata, Nina,
%E Schiavon Porto, Marcelo,
%E Vital, Creto,
%E Pagot, Christian Azambuja,
%E Petronetto, Fabiano,
%E Clua, Esteban,
%E Cardeal, Flávio,
%B Conference on Graphics, Patterns and Images, 30 (SIBGRAPI)
%C Niterói, RJ, Brazil
%8 17-20 Oct. 2017
%I IEEE Computer Society
%J Los Alamitos
%S Proceedings
%K Computational Geometry, Computer Graphics, Manifold.
%X A digital image may contain objects that can be made up of multiple regions concerning different material properties, physical or chemical attributes. Thus, segmented simplicial meshes with non-manifold boundaries are generated to represent the partitioned regions. We focus on repairing non-manifold boundaries. Current methods modify the topology, geometry or both, using their own data structures. The problem of modifying the topology is that if the mesh has to be post-processed, for instance with the Delaunay refinement, the mesh becomes unsuitable. In this paper, we propose alternatives to repair non-manifold boundaries of segmented simplicial meshes, among them is the Delaunay based one, we use common data structures and only consider 2 and 3 dimensions. We developed algorithms for this purpose, composed of the following tools: relabeling, point insertion and simulated annealing. These algorithms are applied depending on the targeted contexts, if we want to speed the process, keep as possible the original segmented mesh or keep the number of elements in the mesh.
%@language en
%3 143.pdf